Verifying an Innnite Family of Inductions Simultaneously Using Data Independence and Fdr (extended Abstract)
نویسنده
چکیده
منابع مشابه
Formal Veri cation of Arbitrary Network Topologies
We show how data independence results can be used to generalise an inductive proof from binary to arbitrary branching tree networks. The example used is modelled on the RSVP Resource Reservation Protocol. Of particular interest is the need for a separate lower-level induction which is itself closely tied to data independence. The inductions combine the use of the process algebra CSP to model sy...
متن کاملFormal Verification of Arbitrary Network Topologies
We show how data independence re sults can be used to generalise an inductive proof from binary to arbitrary branching tree networks The example used is modelled on the RSVP Re source Reservation Protocol Of particular inter est is the need for a separate lower level induction which is itself closely tied to data independence The inductions combine the use of the process alge bra CSP to model s...
متن کاملConstruction of Abstract State Graphs of Innnite Systems with Pvs
In this paper, we propose a method for the automatic construction of an abstract state graph of an innnite state system using the Pvs theorem prover. Given a system and a partition of the state space induced by predicates ' 1 ; :::; ' ` on the program variables which deenes an abstract state space, we construct an abstract state graph, starting in the abstract initial state. The possible succes...
متن کاملAnalyzing Fair Parametric Extended Automata
We address the problem of verifying safety and liveness properties for innnite-state systems, using symbolic reachability analysis. The models we consider are fair parametric extended automata, i.e., counter automata with parametric guards, supplied with fairness conditions on their transitions. In previous work, we shown that symbolic reachabil-ity analysis using acceleration techniques can be...
متن کاملVeriication of Innnite-state Systems by Combining Abstraction and Reachability Analysis ?
We address the problem of verifying systems operating on diierent types of variables ranging over innnite domains. We consider in particular systems modeled by means of extended automata communicating through unbounded fo channels. We develop a general methodology for analyzing such systems based on combining automatic generation of abstract models (not necessarily nite-state) with symbolic rea...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007